Provably-Secure Identification Scheme based on Braid Group
نویسندگان
چکیده
In this paper we construct a new interactive identification scheme based on the conjugacy problem. We prove that this scheme is secure against passive attacks if the matching triple search problem (MTSP) is intractable. Our proof is based on the fact that the conjugacy search problem (CSP) is hard in braid group, on the other hand, the conjugacy decision problem (CDP) is easy in braid group by Ko et al.’s algorithm.
منابع مشابه
Artemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملProvably Secure and Practical Identification Schemes and Corresponding Signature Schemes
This paper presents a three-move interactive identification scheme and proves it to be as secure as t h e discrete logarithm problem. This provably secure scheme is almost as efficient as t,he Schnorr identification scheme, while the Schnorr scheme is not provably secure. This paper also presents another practical identification scheme which is proven to be as secure as the factoring problem ar...
متن کاملProvably Authenticated Group Key Agreement Based on Braid Groups - The Dynamic Case
Most group key agreement protocols make use of modular exponential operations which require extensive computing resources in devices. Thus, they are unsuitable for resourceconstrained devices such as mobile phones, smart cards and intelligent watches. This paper proposes a group key agreement protocol based on braid groups which requires only multiplication operations. The proposed protocol is ...
متن کاملPractical Identification Schemes as Secure as the DL and RSA problems (Submission to P1363a)
We present a practical three-move interactive identification scheme, ID-DL, and prove it to be as secure as the discrete logarithm problem. ID-DL is almost as efficient as the Schnorr identification scheme, which is not provably secure. We also present another practical identification scheme, ID-RSA, which is proven to be as secure as the RSA problem and almost as efficient as the Guillou-Quisq...
متن کامل